Interacting components as logic programs that play games
نویسنده
چکیده
We present a framework for developing complex interacting components in computational logic. Interactive components are developed either as players making moves according to the rules of a game or as umpires that enforce the rules, thereby controlling the interactions of players. From building knowledge-based front-ends with multilingual support, we extend the framework to support the development of interfaces for connected community systems based on agents. The potential of the resulting programming methodology is that centralized organizations via umpires and decentralized organizations with autonomous players can be combined to produce interactive systems of a very complex nature.
منابع مشابه
Model Checking GDL through MOCHA: A Case Study
The Game Description Language (GDL) is a special purpose declarative language for defining games. GDL is used in the AAAI General Game Playing Competition, which tests the ability of computer programs to play games in general, rather than just to play a specific game. Software participants in the competition are provided with a game specified in GDL, and then required to play this game, interpr...
متن کاملA Fast Glimpse of Knowledge{Based Front{Ends as Games
We present a framework for interactive systems with particular attention to the development of Knowledge-Based Front-Ends to software packages. The framework is presented as a set of logic programs that enable the construction of complex interactive systems build from simple interactive components that we call games 11]. The framework is motivated from an analysis of GLIMPSE and FAST, two Knowl...
متن کاملStrategy Logics and the Game Description Language
The Game Description Language (GDL) is a special purpose declarative language for defining games. GDL is used in the AAAI General Game Playing Competition, which tests the ability of computer programs to play games in general, rather than just to play a specific game. Participants in the competition are provided with a game specified in GDL, and then required to play this game. Recently, there ...
متن کاملChoice Logic Programs and Nash Equilibria in Strategic Games
We define choice logic programs as negation-free datalog programs that allow rules to have exclusive-only disjunctions in the head. We show that choice programs are equivalent to semi-negative datalog programs, at least as far as stable models are concerned. We also discuss an application where strategic games can be naturally formulated as choice programs; it turns out that the stable models o...
متن کاملExtensional Semantics of Program Behaviour: Case for Support
G ame semantics is a way of characterizing programming languages and logical calculi intensionally by interpreting proofs or programs as strategies for interacting with the environment; this process of interaction can be thought of as playing a two-person game. Games can capture precisely the behaviour of higher-order programs in sequential languages, in a fashion which is very difficult or imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007